The edge-Wiener index of a graph
نویسندگان
چکیده
If G is a connected graph, then the distance between two edges is, by definition, the distance between the corresponding vertices of the line graph of G. The edge-Wiener index We of G is then equal to the sum of distances between all pairs of edges of G. We give bounds on We in terms of order and size. In particular we prove the asymptotically sharp upper bound We(G) ≤ 25 55 n5 + O(n9/2) for graphs of order n.
منابع مشابه
MORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملOn the edge reverse Wiener indices of TUC4C8(S) nanotubes
The edge versions of reverse Wiener indices were introduced by Mahmiani et al. very recently. In this paper, we find their relation with ordinary (vertex) Wiener index in some graphs. Also, we compute them for trees and TUC4C8(s) naotubes.
متن کاملA note on connectivity and lambda-modified Wiener index
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملOn the Wiener Index of Some Edge Deleted Graphs
The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009